Bisubmodular polyhedra, simplicial divisions, and discrete convexity
نویسنده
چکیده
We consider a class of integer-valued discrete convex functions, called BS-convex functions, defined on integer lattices whose affinity domains are sets of integral points of integral bisubmodular polyhedra. We examine discrete structures of BSconvex functions and give a characterization of BS-convex functions in terms of their convex conjugate functions by means of (discordant) Freudenthal simplicial divisions of the dual space.
منابع مشابه
Generalized skew bisubmodularity: A characterization and a min-max theorem
Huber, Krokhin, and Powell (Proc. SODA2013) introduced a concept of skew bisubmodularity, as a generalization of bisubmodularity, in their complexity dichotomy theorem for valued constraint satisfaction problems over the three-value domain. In this paper we consider a natural generalization of the concept of skew bisubmodularity and show a connection between the generalized skew bisubmodularity...
متن کاملDelta-Matroids, Jump Systems, and Bisubmodular Polyhedra
We relate an axiomatic generalization of matroids, called a jump system, to poly-hedra arising from bisubmodular functions. Unlike the case for usual submodularity, the points of interest are not all the integral points in the relevant polyhedron, but form a subset of them. However, we do show that the convex hull of the set of points of a jump system is a bisubmodular polyhedron, and that the ...
متن کاملNeighbor Systems, Jump Systems, and Bisubmodular Polyhedra
The concept of neighbor system, introduced by Hartvigsen (2009), is a set of integral vectors satisfying a certain combinatorial property. In this paper, we reveal the relationship of neighbor systems with jump systems and with bisubmodular polyhedra. We firstly prove that for every neighbor system, there exists a jump system which has the same neighborhood structure as the original neighbor sy...
متن کاملCollapsible Polyhedra and Median Spaces
It is shown that a collapsible, compact, connected, simplicial polyhedron admits a cubical subdivision and a median convexity, such that all cubes are convex subspaces with a convexity of subcubes. Conversely, a compact, connected, cubical polyhedron with a convexity as described admits a collapsible simplicial subdivision. Such a convexity, when it exists, is uniquely determined by the corresp...
متن کاملTitle Generalized skew bisubmodularity: A characterization and a min‒max theorem
Huber, Krokhin, and Powell (2013) introduced a concept of skew bisubmodularity, as a generalization of bisubmodularity, in their complexity dichotomy theorem for valued constraint satisfaction problems over the three-value domain. In this paper we consider a natural generalization of the concept of skew bisubmodularity and show a connection between the generalized skew bisubmodularity and a con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Optimization
دوره 12 شماره
صفحات -
تاریخ انتشار 2014